Legal Consolidation formalised in Defeasible Logic and based on Agents
نویسندگان
چکیده
Updated legal corpora have been indicated by the European Union as fundamental to eDemocracy, and member states looking to set up eGovernment initiatives are acting on that input. However, the usual automation of legal consolidation presents shortcomings, namely, the collapse of temporal dimensions and local views of normative systems. This paper presents solutions to these shortcomings by providing the formalisation in logic of an appropriate legal temporal model and an investigation of the use of the multi-agent paradigm.
منابع مشابه
A formalization of argumentation schemes for legal case-based reasoning in ASPIC+
In this paper we offer a formal account of reasoning with legal cases in terms of argumentation schemes. These schemes, and undercutting attacks associated with them, are formalised as defeasible rules of inference within the ASPIC+ framework. We begin by modelling the style of reasoning with cases developed by Aleven and Ashley in the CATO project, which describes cases using factors, and then...
متن کاملCan Bobby demand delivery? Towards a knowledge-based system for private law
Whereas in all existing systems, legal reasoning is rule-based, over time legal rules have been amended by exceptions and counter-exceptions. Therefore, legal rules are not strict, but defeasible. We report on an approach of using Defeasible Logic Programming (DeLP) for the development of the LiZ system, a knowledge-based decision support system for private law. A knowledge base containing lega...
متن کاملChanging legal systems: legal abrogations and annulments in Defeasible Logic
In this paper we investigate how to represent and reason about legal abrogations and annulments in Defeasible Logic. We examine some options that embed in this setting, and in similar rule-based systems, ideas from belief and base revision. In both cases, our conclusion is negative, which suggests to adopt a different logical model. This model expresses temporal aspects of legal rules, and dist...
متن کاملArgumentation Semantics for Defeasible Logics
Defeasible logic is a simple but efficient rule-based non-monotonic logic. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the modelling of business rules. So far defeasible logic has been defined only proof-theoretically. Argumentation-based semantics have become popular in the area of logic programming. In this paper we give an argumentation...
متن کاملUsing Defeasible Logic Programming for Argumentation-Based Decision Support in Private Law
Legal reasoning is one of the most obvious application areas for computational models of argumentation as the exchange of arguments and counterarguments is the established means for making decisions in law. In this paper we employ Defeasible Logic Programming (DeLP) for representing legal cases and for giving decision-support, exemplary for private law. We give a formalization of legal provisio...
متن کامل